您现在的位置:首页 > 学术研究 > 论文发表 > Data Sharing based on Conflict Graph and Clustering in VANET
Data Sharing based on Conflict Graph and Clustering in VANET
[发布时间:2023-10-11  阅读次数: 347]

作者:Xu Ding, Xiang Zheng, Bixun Zhang, Pengfei Xu, Lei Shi

发表刊物:International Journal of Sensor Networks

年份:October 2023

摘要:Efficient data sharing in autonomous driving is expected to improve road safety. However, time-varying network topologies, limited roadside unit (RSU) coverage, and communication limitations make efficient data sharing challenging. Therefore, we propose an RSU-assisted hybrid scheduling (RAHC) scheme, including centralised scheduling within the RSU and self-organised scheduling in the RSU blind zone. For centralised scheduling, we model data transmission and transmission conflicts as conflict graph based on real-time network topology, and solve for optimal transmission paths while satisfying communication constraints, and increase the chance for vehicles in RSU blind areas to obtain data by carrying and forwarding data. For self-organised scheduling, we use degree of link similarity (DLS) to cluster vehicles and select the vehicle with the largest service capacity (SC) in the cluster to serve the opposite vehicle. This reduces duplication and redundancy of data transmission and improves sharing efficiency. Simulation results demonstrate the superiority of the solution.

参考文献拷贝字段:Xu Ding, Xiang Zheng, Bixun Zhang, Pengfei Xu, Lei Shi. Data Sharing based on Conflict Graph and Clustering in VANET[J]. International Journal of Sensor Networks, 2023, 43(2): 63-77.